Covering the Plane with Fat Ellipses without Non-Crossing Assumption
نویسندگان
چکیده
منابع مشابه
Bottleneck Non-crossing Matching in the Plane
Let P be a set of 2n points in the plane, and letMC (resp.,MNC) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of P . We study the problem of computing MNC. We first prove that the problem is NP-hard and does not admit a PTAS. Then, we present an O(n log n)-time algorithm that computes a noncrossing matching M of P , such that bn(M) ≤ 2 √ 10 · bn(MNC), where bn(M) is t...
متن کاملLong non-crossing configurations in the plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computational Geometry, 1993). Given a set of n points in the plane in general position (no three points collinear), compute a longest non-crossing configuration composed of straight line segments that is: (a) a matching (b) a Ha...
متن کاملNon-crossing Connectors in the Plane
We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R1, . . . , Rn in the plane and finite point sets Pi ⊂ Ri for i = 1, . . . , n, are there non-crossing connectors γi for (Ri, Pi), i.e., arc-connected sets γi with Pi ⊂ γi ⊂ Ri for every i = 1, . . . , n, such that γi ∩ γj = ∅ for all i 6= j? We prove that non-crossing connectors do alw...
متن کاملLattice Packing in the Plane without Crossing Arcs
Introduction. We first review some definitions and results of Chalk and Rogers.2 If S and T are two sets of points in Euclidean »-space, then S+T will denote the set of all points s+t where s is in 5 and / is in T, while S— T is composed of all s — t. The point set sum will be denoted by 5UF and the intersection by SC\T. Let A be a lattice; then 5+A is a lattice packing if no two sets 5+X and 5...
متن کاملCovering a Polygonal Region by Ellipses
We study the problem of how to cover a polygonal region by a small number of axis–parallel ellipses. This question is well motivated by a special pattern recognition task where one has to identify ellipse shaped protein spots in 2–dimensional electrophoresis images. We present and discuss two algorithmic approaches solving this problem: a greedy brute force method and a linear programming formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2003
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-002-2835-z